package cn.leonis.leetcode;

/**
 * @author Tobi
 * @time 2021-07-10 2:27 PM
 * 搜索旋转排序数组,原排序数组一定在中间位置旋转
 */
public class SearchRotatedArraySolution {

    public static void main(String[] args) {
        int[]  nums = new int[]{4, 5, 6, 7, 0, 1, 2};
        SearchRotatedArraySolution solution = new SearchRotatedArraySolution();
        System.out.println(solution.search(nums, 4));
    }

    public int search(int[] nums, int target) {
        int n = nums.length;
        if (n == 0) {
            return -1;
        }
        if (n == 1) {
            return nums[0] == target ? 0 : -1;
        }
        int left = 0, right = n - 1;
        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (nums[mid] == target) {
                return mid;
            }
            if (nums[0] <= nums[mid]) {
                if (nums[0] <= target && nums[mid] > target) {
                    right = mid - 1;
                }else {
                    left = mid + 1;
                }
            } else {
                if (nums[mid] < target && target <= nums[n - 1]) {
                    left = mid + 1;
                }else {
                    right = mid - 1;
                }
            }
        }

        return -1;
    }
}
